Generalization and Reuse of Tactic Proofs
نویسندگان
چکیده
A tactic proof is a tree-structured sequent proof where steps may be justiied by tactic programs. We describe a prototype of a generic interactive theorem-proving system that supports the construction and manipulation of tactic proofs containing metavariables. The emphasis is on proof reuse. Examples of proof reuse are proof by analogy and reconstruction of partial proofs as part of recovering from errors in deeni-tions or in proof strategies. Our reuse operations involve solving higher-order uniication problems, and their eeectiveness relies on a proof-generalization step that is done after a tactic is applied. The prototype is implemented in Prolog.
منابع مشابه
Generalization and Reuse of Tactic
A tactic proof is a tree-structured sequent proof where steps may be justiied by tactic programs. We describe a prototype of a generic interactive theorem-proving system that supports the construction and manipulation of tactic proofs containing metavariables. The emphasis is on proof reuse. Examples of proof reuse are proof by analogy and reconstruction of partial proofs as part of recovering ...
متن کاملHigher order generalization and its application
Generalization is a fundamental operation of inductive inference. While rst order syntactic generalization (anti-uniication) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language 221]. Based on the application ordering, we prove that least general generalization exists for any two terms ...
متن کاملReuse of Proofs by Meta-methods
This paper describes a declarative approach for encoding the plan operators in proof planning, the so-called methods. The notion of method evolves from the much studied concept of a tactic and was rst used by A. Bundy. Signiic-ant deductive power has been achieved with the planning approach towards automated deduction ; however, the procedural character of the tactic part of methods hinders mec...
متن کاملDeriving class instances for datatypes
We provide a framework for registering automatic methods to derive class instances of datatypes, as it is possible using Haskell’s “deriving Ord, Show, . . . ” feature. We further implemented such automatic methods to derive (linear) orders or hash-functions which are required in the Isabelle Collection Framework [1] and the Container Framework [2]. Moreover, for the tactic of Huffman and Kraus...
متن کاملRippling: A Heuristic for Guiding Inductive Proofs
We describe rippling: a tactic for the heuristic control of the key part of proofs by mathematical induction. This tactic signiicantly reduces the search for a proof of a wide variety of inductive theorems. We rst present a basic version of rippling, followed by various extensions which are necessary to capture larger classes of inductive proofs. Finally, we present a general-ised form of rippl...
متن کامل